Lattice Embedding of Heronian Simplices
نویسنده
چکیده
A rational triangle has rational edge-lengths and area; a rational tetrahedron has rational faces and volume; either is Heronian when its edge-lengths are integer, and proper when its content is nonzero. A variant proof is given, via complex number GCD, of the previously known result that any Heronian triangle may be embedded in the Cartesian lattice Z; it is then shown that, for a proper triangle, such an embedding is unique modulo lattice isometry; finally the method is extended via quaternion GCD to tetrahedra in Z, where uniqueness no longer obtains, and embeddings also exist which are unobtainable by this construction. The requisite complex and quaternionic number theoretic background is summarised beforehand. Subsequent sections engage with subsidiary implementation issues: initial rational embedding, canonical reduction, exhaustive search for embeddings additional to those yielded via GCD; and illustrative numerical examples are provided. A counter-example shows that this approach must fail in higher dimensional space. Finally alternative approaches by other authors are summarised.
منابع مشابه
EMBEDDING OF THE LATTICE OF IDEALS OF A RING INTO ITS LATTICE OF FUZZY IDEALS
We show that the lattice of all ideals of a ring $R$ can be embedded in the lattice of all its fuzzyideals in uncountably many ways. For this purpose, we introduce the concept of the generalizedcharacteristic function $chi _{s}^{r} (A)$ of a subset $A$ of a ring $R$ forfixed $r , sin [0,1] $ and show that $A$ is an ideal of $R$ if, and only if, its generalizedcharacteristic function $chi _{s}^{...
متن کاملHeronian Tetrahedra Are Lattice Tetrahedra
Extending a similar result about triangles, we show that each Heronian tetrahedron may be positioned with integer coordinates. More generally, we show the following: if an integral distance set in R can be positioned with rational coordinates, then it can in fact be positioned with integer coordinates. The proof, which uses the arithmetic of quaternions, is tantamount to an algorithm.
متن کاملPrimitive Heronian Triangles With Integer Inradius and Exradii
It is well known that primitive Pythagorean triangles have integer inradius and exradii. We investigate the generalization to primitive Heronian triangles. In particular, we study the special cases of isosceles triangles and triangles with sides in arithmetic progression. We also give two families of primitive Heronian triangles, one decomposable and one indecomposable, which have integer inrad...
متن کاملAn Introduction to Empty Lattice Simplices
We study simplices whose vertices lie on a lattice and have no other lattice points. Suchèmpty lattice simplices' come up in the theory of integer programming, and in some combi-natorial problems. They have been investigated in various contexts and under varying terminology Can thèemptiness' of lattice simplices bèwell-characterized' ? Is theirìattice-width' small ? Do the integer points of the...
متن کاملMaximal integral simplices with no interior integer points
In this paper, we consider integral maximal lattice-free simplices. Such simplices have integer vertices and contain integer points in the relative interior of each of their facets, but no integer point is allowed in the full interior. In dimension three, we show that any integral maximal latticefree simplex is equivalent to one of seven simplices up to unimodular transformation. For higher dim...
متن کامل